The time-dependent vehicle routing problem with soft time windows and stochastic travel times
نویسندگان
چکیده
منابع مشابه
The time-dependent vehicle routing problem with soft time windows and stochastic travel times
This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics a...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملVehicle routing problem with stochastic travel times including soft time windows and service costs
This paper studies a vehicle routing problem with soft time windows and stochastic travel times. A model is developed that considers both transportation costs (total distance traveled, number of vehicles used and drivers’ total expected overtime) and service costs (early and late arrivals). We propose a Tabu Search method to solve this model. An initialization algorithm is developed to construc...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملModeling and Solving the Vehicle Routing Problem with Stochastic Travel Times and Hard Time Windows
In practically all real-world planning and scheduling problems one is faced with uncertainty. Usually this uncertainty is abstracted away during the modeling process, such that standard combinatorial optimization algorithms can be used to solve the problem. This abstraction step is necessary, because these algorithms generally cannot deal with uncertainty. In this thesis we study the Vehicle Ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C: Emerging Technologies
سال: 2014
ISSN: 0968-090X
DOI: 10.1016/j.trc.2014.08.007